منابع مشابه
Polynomial dual network simplex algorithms
The transshipment problem is one of the central problems in network optimization. There exist several polynomial and strongly polynomial algorithms for solving this problem (see the surveys [7, 1]). Nevertheless, the method of choice in practice still seems to be the network simplex method. In this paper we shall consider the dual network simplex method. We show that some excess scaling algorit...
متن کاملPolynomial time algorithms for dual volume sampling
We study dual volume sampling, a method for selecting k columns from an n⇥m short and wide matrix (n k m) such that the probability of selection is proportional to the volume spanned by the rows of the induced submatrix. This method was proposed by Avron and Boutsidis (2013), who showed it to be a promising method for column subset selection and its multiple applications. However, its wider...
متن کاملTowards Polynomial Simplex-Like Algorithms for Market Equlibria
In this paper we consider the problem of computing market equilibria in the Fisher setting for utility models such as spending constraint and perfect, price-discrimination which are inspired from modern e-commerce settings and attempt to bridge the gap between the computationally hard, but realistic, separable, piecewise-linear and concave utility model and the tractable, but less relevant, lin...
متن کاملTowards Polynomial Simplex-Like Algorithms for Market Equilibria
In this paper we consider the problem of computing market equilibria in the Fisher setting for utility models such as spending constraint and perfect, price-discrimination. These models were inspired from modern e-commerce settings and attempt to bridge the gap between the computationally hard but realistic separable, piecewise-linear and concave utility model and, the tractable but less releva...
متن کاملDual Simplex
The dual simplex algorithm is an attractive alternative as a solution method for linear programming problems. Since the addition of new constraints to a problem typically breaks primal feasibility but not dual feasibility, the dual simplex can be deployed for rapid reoptimization, without the need of finding new primal basic feasible solutions. This is especially useful in integer programming, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 1993
ISSN: 0025-5610,1436-4646
DOI: 10.1007/bf01580615